Parity graph

Results: 58



#Item
21Linear and conic programming relaxations:   Graph structure and message-passing

Linear and conic programming relaxations: Graph structure and message-passing

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2010-10-20 16:19:00
22QUASIRANDOM GROUPS W. T. Gowers Abstract. Babai and Sos have asked whether there exists a constant c > 0 such that every finite group G has a product-free subset of size at least c|G|: that is, a subset X that does not c

QUASIRANDOM GROUPS W. T. Gowers Abstract. Babai and Sos have asked whether there exists a constant c > 0 such that every finite group G has a product-free subset of size at least c|G|: that is, a subset X that does not c

Add to Reading List

Source URL: www.dpmms.cam.ac.uk

Language: English - Date: 2006-10-22 13:27:46
23On the Pagenumber of Bipartite Orders Mustafa Alhashem∗ Guy-Vincent Jourdan∗  ∗

On the Pagenumber of Bipartite Orders Mustafa Alhashem∗ Guy-Vincent Jourdan∗ ∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:47
24

PDF Document

Add to Reading List

Source URL: www.cl.cam.ac.uk

Language: English - Date: 2008-09-22 06:20:56
25

PDF Document

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2014-12-04 03:05:14
26LDPC Codes – a brief Tutorial Bernhard M.J. Leiner, Stud.ID.: 53418L  April 8,

LDPC Codes – a brief Tutorial Bernhard M.J. Leiner, Stud.ID.: 53418L April 8,

Add to Reading List

Source URL: www.bernh.net

Language: English - Date: 2014-05-29 16:27:32
27

PDF Document

Add to Reading List

Source URL: darwin.bth.rwth-aachen.de

Language: English - Date: 2012-01-17 04:43:03
28On Set Intersection Representations of Graphs ∗ S. Jukna †‡ Abstract The intersection dimension of a bipartite graph with respect to a type L is the smallest number t for which it is possible to assign sets Ax ⊆

On Set Intersection Representations of Graphs ∗ S. Jukna †‡ Abstract The intersection dimension of a bipartite graph with respect to a type L is the smallest number t for which it is possible to assign sets Ax ⊆

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2008-10-14 11:56:16
29On Graph Complexity  S . J U K N A† Universit¨ at Frankfurt, Institut f¨ ur Informatik

On Graph Complexity S . J U K N A† Universit¨ at Frankfurt, Institut f¨ ur Informatik

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2009-01-04 06:50:40
30Playing Pushdown Parity Games in a Hurry Wladimir Fridman Martin Zimmermann  Chair of Computer Science 7

Playing Pushdown Parity Games in a Hurry Wladimir Fridman Martin Zimmermann Chair of Computer Science 7

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2012-07-12 10:32:22